http://krepublishers.com/02-Journals/JSSA/JSSA-04-0-000-13-Web/JSSA-04-0-000-13-Contents/JSSA-04-0-000-13-Contents.htm
نویسندگان
چکیده
منابع مشابه
مقایسه آزمایشگاهی ریزنشت آپیکالی در روش تراکم جانبی با استفاده از مخروط‌های گوتاپرکای اصلی 02/0 و 04/0
Background and Aim: The final objective of root canal therapy is to create a hermetic seal along the length of the root canal system from the coronal opening to the apical termination and to accomplish the best adaptation of obturation material with canal walls. The purpose of this study was to compare the microleakage during lateral condensation of 0.04 and 0.02 tapered gutta-percha master con...
متن کاملCytochrome p450 Genotyping - 04/13
Various factors may influence the variability of drug effects, including age, liver function, concomitant diseases, nutrition, smoking, and drug-drug interactions. Inherited (germline) DNA sequence variation (polymorphisms) in genes coding for drug metabolizing enzymes, drug receptors, drug transporters, and molecules involved in signal transduction pathways also may have major effects on the a...
متن کامل13 PEPERSACK/c:04 LORD_c
Background: Health services for the elderly are becoming increasingly important in industrialized nations, and comprehensive geriatric assessment (CGA) is one of the procedures designed to improve the health of this sector of the population. In 2003 a survey among Belgian geriatricians showed that despite the interest of the geriatric teams for comprehensive geriatric assessment, it was not use...
متن کامل0-000 Approaching Fracture Density: Anisotropic Gradient = Fracture Density?
For optimal hydrocarbon recovery from fractured reservoirs, a critical issue is to gain an accurate understanding of the natural fracture system. Currently, fracture characterization using amplitude based technologies is routinely performed relying on amplitude versus angle/offset (AVA/AVO) and azimuth (AVAZ) to exploit anisotropic gradient behavior, which is today commonly used in the industry...
متن کاملLecture 04 / 13 : Graph Sampling and Sparsification
In previous lectures, we discussed various topics on graph: sparsest cut, clustering which finds small k-cuts, max flow, multicommodity flow, etc. For very large graphs, we’d like to ask “instead of regular approximation algorithms which run in polynomial time, can we find any near-linear time algorithm for minimum cut or maximum flow problems?”. A simple idea is for a given graph G, to solve t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF SOCIOLOGY AND SOCIAL ANTHROPOLOGY
سال: 2013
ISSN: 0976-6634,2456-6764
DOI: 10.31901/24566764.2013/04.03.07